An Eecient Method of Constructing States in Bottom-up Tree Pattern Matching
نویسندگان
چکیده
In this paper, we propose an e cient method of constructing states in bottom-up tree pattern matching with dynamic programming technique for optimal code generation. This method can be derived from some relations over tree patterns. The proposed scheme is more e cient than other scheme because we can avoid unfruitful tests with the smaller size of the scheme. Furthermore, the relevant analyses needed for this proposal are largely achieved at compile-compile time, which secures actual e ciency at compilation time.
منابع مشابه
An Eecient Bottom-up Tree Pattern Matching for Code Selection That Does Dynamic Programming at Compile-time
An e cient tree pattern matching with dynamic programming for selecting the optimal code is proposed. It is devised through a close examination of some relation over tree patterns. The scheme is more e cient than other works in the sense that it performs less unfruitful tests and the code size of it is smaller. Its rationale is also intuitively clear and natural. Furthermore, the relevant analy...
متن کاملEfficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching
Instruction selection is the primary task in automatic code generation. This paper proposes a practical system for performing optimal instruction selection based on tree pattern matching for expression trees. A significant feature of the system is its ability to perform code generation without requiring cost analysis at code generation time. The target machine instructions are specified as attr...
متن کاملA new algorithm for linear regular tree pattern matching
We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a nite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of the subject tree, the size of the automaton can be exponential in the sum of the sizes of all patt...
متن کاملOptimal Left-to-Right Pattern-Matching Automata
We propose a practical technique to compile pattern-matching for prioritised overlapping patterns in equational languages into a minimal, deterministic, left-toright, matching automaton. First, we present a method for constructing a tree matching automaton for such patterns. This allows pattern-matching to be performed without any backtracking. Space requirements are reduced by using a directed...
متن کاملBottom-Up Tree Acceptors
This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...
متن کامل